On a conjecture of Beard, O'Connell and West concerning perfect polynomials
نویسندگان
چکیده
Following Beard, O’Connell and West (1977) we call a polynomial over a finite field Fq perfect if it coincides with the sum of its monic divisors. The study of perfect polynomials was initiated in 1941 by Carlitz’s doctoral student Canaday in the case q = 2, who proposed the still unresolved conjecture that every perfect polynomial over F2 has a root in F2. Beard, et al. later proposed the analogous hypothesis for all finite fields. Counterexamples to this general conjecture were found by Link (in the cases q = 11, 17) and Gallardo & Rahavandrainy (in the case q = 4). Here we show that the Beard-O’Connell-West conjecture fails in all cases except possibly when q is prime. When q = p is prime, utilizing a construction of Link we exhibit a counterexample whenever p ≡ 11 or 17 (mod 24). On the basis of a polynomial analog of Schinzel’s Hypothesis H, we argue that if there is a single perfect polynomial over the finite field Fq with no linear factor, then there are infinitely many. Lastly, we prove without any hypothesis that there are infinitely many perfect polynomials over F11 with no linear factor.
منابع مشابه
On the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملSome new families of definite polynomials and the composition conjectures
The planar polynomial vector fields with a center at the origin can be written as an scalar differential equation, for example Abel equation. If the coefficients of an Abel equation satisfy the composition condition, then the Abel equation has a center at the origin. Also the composition condition is sufficient for vanishing the first order moments of the coefficients. The composition conjectur...
متن کاملPartial proof of Graham Higman's conjecture related to coset diagrams
Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...
متن کاملSome difference results on Hayman conjecture and uniqueness
In this paper, we show that for any finite order entire function $f(z)$, the function of the form $f(z)^{n}[f(z+c)-f(z)]^{s}$ has no nonzero finite Picard exceptional value for all nonnegative integers $n, s$ satisfying $ngeq 3$, which can be viewed as a different result on Hayman conjecture. We also obtain some uniqueness theorems for difference polynomials of entire functions sharing one comm...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 14 شماره
صفحات -
تاریخ انتشار 2008